Extracting useful knowledge from event logs: A frequent itemset mining approach

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combined Approach for Mining Fuzzy Frequent Itemset

Frequent Itemset Mining is an important approach for Market Basket Analysis. Earlier, the frequent itemsets are determined based on the customer transactions of binary data. Recently, fuzzy data are used to determine the frequent itemsets because it provides the nature of frequent itemset ie. , it describes whether the frequent itemset consists of only highly purchased items or medium purchased...

متن کامل

A Partial Optimization Approach for Privacy Preserving Frequent Itemset Mining

While data mining has been widely acclaimed as a technology that can bring potential benefits to organizations, such efforts may be negatively impacted by the possibility of discovering sensitive patterns, particularly in patient data. In this article the authors present an approach to identify the optimal set of transactions that, if sanitized, would result in hiding sensitive patterns while r...

متن کامل

TR-2009001: BISC: A Binary Itemset Support Counting Approach towards Efficient Frequent Itemset Mining

the performance of a depth-first Frequent Itemset Miming (FIM) algorithm is closely related to the total number of recursions which can be modeled as O(n), where k is the maximal recursion depth and n is the branching factor. Many existing approaches focus more on improving support counting rather than on decreasing n and k, which may lead to unsatisfactory performance as they grow. In this pap...

متن کامل

BISC: a Binary Itemset Support Counting Approach towards Efficient Frequent Itemset Mining

the performance of a depth-first Frequent Itemset Miming (FIM) algorithm is closely related to the total number of recursions which can be modeled as O(n), where k is the maximal recursion depth and n is the branching factor. Many existing approaches focus more on improving support counting rather than on decreasing n and k, which may lead to unsatisfactory performance as they grow. In this pap...

متن کامل

A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs

Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, the mining of frequent patterns from event logs is an important system and network management task. This paper discusses the properties of event log data, analyses the suitability of popular mining algorithms for processing event log data, and proposes an efficient algorithm for mining frequent patterns...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Knowledge-Based Systems

سال: 2018

ISSN: 0950-7051

DOI: 10.1016/j.knosys.2017.10.016